Improving Relational Search Performance using Relational Symmetries and Predictors
نویسندگان
چکیده
منابع مشابه
Improving relational similarity measurement using symmetries in proportional word analogies
Measuring the similarity between the semantic relations that exist between words is an important step in numerous tasks in natural language processing such as answering word analogy questions, classifying compound nouns, and word sense disambiguation. Given two word pairs (A,B) and (C,D), we propose a method to measure the relational similarity between the semantic relations that exist between ...
متن کاملImproving Relational Classification Using Link Prediction Techniques
In this paper, we address the problem of classifying entities belonging to networked datasets. We show that assortativity is positively correlated with classification performance and how we are able to improve classification accuracy by increasing the assortativity of the network. Our method to increase assortativity is based on modifying the weights of the edges using a scoring function. We ev...
متن کاملRelational Web Search
Facts are naturally organized in terms of entities, classes, and their relationships as in an entity-relationship diagram or a semantic network. Search engines have eschewed such structures because, in the past, their creation and processing have not been practical at Web scale. This paper introduces the extraction graph, a textual approximation to an entity-relationship graph, which is automat...
متن کاملRelational Keyword Search System Using Fuzzy Type-Ahead Search
The search performance is one of major concern in any of search query method presented by different researchers. There are many methods already presented and for improving the search results performances still in this area continue working is going. One of the most commonly used method is autocomplete, which predicts a word or phrase that the user may type in based on the partial string the use...
متن کاملChinese Latent Relational Search Based on Relational Similarity
Latent relational search is a new way of searching information in an unknown domain according to the knowledge of a known domain from the Web. By analyzing the analogous relationship between word pairs, the latent relational search engine can tell us the accurate information that we need. Given a Chinese query, {(A, B), (C, ?)}, our aim is to get D which is the answer of “?”. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2011
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.26.649